Deterministic Decentralized Search in Random Graphs
نویسندگان
چکیده
منابع مشابه
Deterministic Decentralized Search in Random Graphs
We study a general framework for decentralized search in random graphs. Our main focus is on deterministic memoryless search algorithms that use only local information to reach their destination in a bounded number of steps in expectation. This class includes (with small modifications) the search algorithms used in Kleinberg’s pioneering work on long-range percolation graphs and hierarchical ne...
متن کاملDecentralized Search with Random Costs
A decentralized search algorithm is a method of routing on a random graph that uses only limited, local, information about the realization of the graph. In some random graph models it is possible to define such algorithms which produce short paths when routing from any vertex to any other, while for others it is not. We consider random graphs with random costs assigned to the edges. In this sit...
متن کاملDeterministic Random Walks on Finite Graphs
The rotor-router model, also known as the Propp machine, is a deterministic process analogous to a random walk on a graph [1]. Instead of distributing tokens to randomly chosen neighbors, the rotor-router model deterministically serves the neighbors in a fixed order by associating to each vertex a “rotor-router” pointing to one of its neighbors. The rotor-router model sometimes appears under th...
متن کاملDeterministic walks in random networks: an application to thesaurus graphs
In a landscape composed of N randomly distributed sites in Euclidean space, a walker (“tourist”) goes to the nearest one that has not been visited in the last τ steps. This procedure leads to trajectories composed of a transient part and a final cyclic attractor of period p. The tourist walk presents universal aspects with respect to τ and can be done in a wide range of networks that can be vie...
متن کاملDisperser Graphs, Deterministic Amplification and Imperfect Random Sources
We use a certain type of expanding bipartite graphs, called disperser graphs, to design procedures for sampling a finite number of elements from a finite set, with the property that the probability of hitting any sufficiently large subset is high. The advantages of these procedures are: 1. They require a relatively small number of random bits. 2. They are robust with respect to the quality of t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Internet Mathematics
سال: 2008
ISSN: 1542-7951,1944-9488
DOI: 10.1080/15427951.2008.10129298